#include"BinarySearchTree.hpp"

int main() {
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> bt;
	for (auto& e : a) {
		bt.InsertR(e);
	}
	bt.InOrder();

	for (auto& e : a) {
		bt.EraseR(e);
		bt.InOrder();
		cout << endl;
	}
	//for (auto& e:a) {
	//	bt.FindR(e);
	//}

	return 0;
}